A New Generalized Partition Crossover for the Traveling Salesman Problem: Tunneling between Local Optima
نویسندگان
چکیده
منابع مشابه
Thesis Generalized Partition Crossover for the Traveling Salesman Problem
OF THESIS GENERALIZED PARTITION CROSSOVER FOR THE TRAVELING SALESMAN
متن کاملA Hybrid Genetic Algorithm for the Traveling Salesman Problem Using Generalized Partition Crossover
We present a hybrid Genetic Algorithm that incorporates the Generalized Partition Crossover (GPX) operator to produce an algorithm that is competitive with the state of the art for the Traveling Salesman Problem (TSP). GPX is respectful, transmits alleles and is capable of tunneling directly to new local optima. Our results show that the Hybrid Genetic Algorithm quickly finds optimal and near o...
متن کاملAN EFFICIENT CROSSOVER OPERATOR FOR TRAVELING SALESMAN PROBLEM
Crossover operator plays a crucial role in the efficiency of genetic algorithm (GA). Several crossover operators have been proposed for solving the travelling salesman problem (TSP) in the literature. These operators have paid less attention to the characteristics of the traveling salesman problem, and majority of these operators can only generate feasible solutions. In this paper, a crossover ...
متن کاملNew Genetic Operator (Jump Crossover) for the Traveling Salesman Problem
Inspired by nature, genetic algorithms (GA) are among the greatest meta-heuristics optimization methods that have proved their effectiveness to conventional NP-hard problems, especially the traveling salesman problem (TSP) which is one of the most studied supply chain management problems. This paper proposes a new crossover operator called Jump Crossover (JMPX) for solving the travelling salesm...
متن کاملVoronoi Quantized Crossover for Traveling Salesman Problem
It is known that the performance of a genetic algorithm depends on the survival environment and the reproducibility of building blocks. In this paper, we propose a new encoding/crossover scheme that uses genic distance which explicitly de nes the distance between each pair of genes in the chromosome. It pursues both relatively high survival probabilities of more epistatic gene groups and divers...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Evolutionary Computation
سال: 2020
ISSN: 1063-6560,1530-9304
DOI: 10.1162/evco_a_00254